On the non-optimality of the FB discipline within the service time distribution class IMRL
نویسندگان
چکیده
It is known that, within the service time distribution class DHR, the FB discipline minimizes the mean delay in the M/G/1 queue among all work-conserving and non-anticipating service disciplines. It is also believed that a similar result is valid within a more general distribution class IMRL. However, we point out a flaw in the existing proof of this latter result that cannot be overcome. Moreover, by constructing a counter-example, we demonstrate that FB is not optimal within class IMRL. On the other hand, we prove that the mean delay for FB is smaller than that of PS within class IMRL giving a weaker version of an earlier hypothesis. 2000 Mathematics Subject Classification: 60K25,90B36,68M20
منابع مشابه
On the Nonoptimality of the Foreground–background Discipline for Imrl Service Times
It is known that for decreasing hazard rate (DHR) service times the foreground– background discipline (FB) minimizes the mean delay in the M/G/1 queue among all work-conserving and nonanticipating service disciplines. It is believed that a similar result is valid for increasing mean residual lifetime (IMRL) service times. However, on the one hand, we point out a flaw in an earlier proof of the ...
متن کاملA Non-Preemptive Two-Class M/M/1 System with Prioritized Real-Time Jobs under Earliest-Deadline-First Policy
This paper introduces an analytical method for approximating the performance of a two-class priority M/M/1 system. The system is fully non-preemptive. More specifically, the prioritized class-1 jobs are real-time and served with the non-preemptive earliest-deadline-first (EDF) policy, but despite their priority cannot preempt any non real-time class-2 job. The waiting class-2 jobs can only be s...
متن کاملتعیین موعد مقرر تحویل پروژه در شبکه های پرت پویا با چندین خدمت دهنده
In this paper, multi-class dynamic PERT network is considered as a queueing network, where the projects are similar and new projects are generated according to a Poisson process. Each activity is performed independently in its corresponding service station with exponential distribution by one server from several servers settled in service station based on FCFS (Fist Come, First Served) discipli...
متن کاملOptimal scheduling of service requirements with a DHR tail in the M/G/1 queue
We consider the mean delay optimization in the M/G/1 queue for service time distributions that have a tail with decresing hazard rate (DHR). If the DHR property is valid for the whole distribution, then it is known that the ForegroundBackground (FB) discipline, which gives full priority to the job with least amount of attained service, is optimal among nonanticipating scheduling disciplines. Ho...
متن کاملA heuristic method for consumable resource allocation in multi-class dynamic PERT networks
This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a n...
متن کامل